Texture-based Image Search of Fashion Designs
نویسندگان
چکیده
In today’s world, fashion designers help create billions of dresses, suits, shoes, and other clothing and accessories purchased every year by customers around the world. They study fashion trends, sketch designs of clothing and accessories, select colors and fabrics, and oversee the final production of their designs. With the advent of computers and low storage costs, designers rely on the use of mass computer storage to help them store and manage their designs for future retrievals. The stored designs will be retrieved from time to time so that designers could retrieve them for stimulation of new ideas in their new designs. When the number of stored images grows, searching for a desired piece of design work is likely to be time-consuming and painstaking. Without proper computer-assisted search mechanism, such a search will not be definitely easy. Thus, a huge collection of images containing different designs pattern and textures of certain fashion designs demands for efficient search system. Of all the visual contents identifiable from a design, texture is considered to be the commonest visual attribute that aids in image retrieval. Common approaches for texture-based image retrievals are largely centered around frequency-based models, which are notably suffered from the problem of poor retrieval accuracy. In this paper, a novel approach for texture-based image retrieval has been proposed. This approach, known as Spectral Density Analysis, or SDA for short, is based on the idea of dividing an image into nine equally sized partitions where the spectral density of each partition is computed to be used to aid in the image retrieval process. Benchmarked using the popular performance measurement technique, Recall and Precision, adopting the SDA technique for retrieving images based on their texture contents has produced remarkable retrieval accuracy, almost three times more accurate over any other frequencybased models.
منابع مشابه
A review on search designs and their evaluation criteria
The search designs first introduced in Srivastava (1975) is reviewed. In a ceritan problem, there may be some search designs with same runs. Some criteria for evaluation of search designs are the other topic in the paper. Criteria based on searching probability and expected Kullback- Leibler are reviewd. Some examples are given in each case.
متن کاملUsing Kullback-Leibler distance for performance evaluation of search designs
This paper considers the search problem, introduced by Srivastava cite{Sr}. This is a model discrimination problem. In the context of search linear models, discrimination ability of search designs has been studied by several researchers. Some criteria have been developed to measure this capability, however, they are restricted in a sense of being able to work for searching only one possibl...
متن کاملSome New Properties of the Searching Probability
Consider search designs for searching one nonzero 2- or 3-factor interaction under the search linear model. In the noisy case, search probability is given by Shirakura et al. (Ann. Statist. 24(6) (1996) 2560). In this paper some new properties of the searching probability are presented. New properties of the search probability enable us to compare designs, which depend on an unknown parameter ?...
متن کاملUnsupervised Texture Image Segmentation Using MRFEM Framework
Texture image analysis is one of the most important working realms of image processing in medical sciences and industry. Up to present, different approaches have been proposed for segmentation of texture images. In this paper, we offered unsupervised texture image segmentation based on Markov Random Field (MRF) model. First, we used Gabor filter with different parameters’ (frequency, orientatio...
متن کاملUnsupervised Texture Image Segmentation Using MRFEM Framework
Texture image analysis is one of the most important working realms of image processing in medical sciences and industry. Up to present, different approaches have been proposed for segmentation of texture images. In this paper, we offered unsupervised texture image segmentation based on Markov Random Field (MRF) model. First, we used Gabor filter with different parameters’ (frequency, orientatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008